Scattering function of semi-rigid cyclic polymers analyzed in terms of worm-like rings: cyclic amylose tris(phenylcarbamate) and cyclic amylose tris(n-butylcarbamate)
نویسندگان
چکیده
منابع مشابه
Effect of Surgical Removal of Endometriomas on Cyclic and Non-cyclic Pelvic Pain
Background Endometriosis is a complex disease with a spectrum of pain symptoms from mild dysmenorrhea to debilitating pelvic pain. There is no concrete evidence in the literature whether endometriotic cyst per se, causes pain spectrum related to the disease. The aim of the present study was to evaluate the effect of surgical removal of endometriomas on pain symptoms. MaterialsAndMethods In this...
متن کاملMetallo-supramolecular cyclic polymers.
Cyclic brush polymers represent an exciting new macromolecular topology. For the first time, this new topology has been combined with metallo-supramolecular interactions to construct novel cyclic brush polymers. Here, ring-expansion metathesis polymerization was used to synthesize a universal cyclic template with a polynorbornene backbone, which was further modified with the metal-chelating syn...
متن کاملAmylose-wrapped luminescent conjugated polymers.
Highly luminescent inclusion complexes consisting of poly(para-phenylene) (PPP) or poly(4,4'-diphenylene-vinylene) (PDV) in the helical cavity of amylose have been synthesised, structurally characterised by nuclear Overhauser spectroscopy and used to fabricate electroluminescent light-emitting diodes.
متن کاملBirationally rigid Fano cyclic covers
then V is a primitive Fano variety of dimensionM , that is, Pic V = ZKV and (−KV ) is ample. The purpose of this note is to sketch a proof of the following Theorem 1. A general (in the sense of Zariski topology) variety V is birationally superrigid. In particular, V admits no non-trivial structures of a rationally connected fibration, any birational map V 99K V ♯ onto a Fano variety with Q-fact...
متن کاملCyclic codes over finite rings
It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polymer Journal
سال: 2017
ISSN: 0032-3896,1349-0540
DOI: 10.1038/pj.2017.27